Mean field conditions for coalescing random walks
نویسندگان
چکیده
منابع مشابه
Mean field conditions for coalescing random walks
The main results in this paper are about the full coalescence time C of a system of coalescing random walks over a finite graph G. Letting m(G) denote the mean meeting time of two such walkers, we give sufficient conditions under which E [C] ≈ 2m(G) and C/m(G) has approximatelly the same law as in the “mean field” setting of a large complete graph. One of our theorems is that mean field behavio...
متن کاملAsymptotic properties of coalescing random walks
A Coalescing random walk is an interacting particle system which can be described as the following. Suppose that there is one particle located at each integer position [0, n] at time point 0 and that a particle is chosen at random at any time point t among the remaining in [1, n] and moves one step in some direction, where the direction can be deterministic or stochastic. The particle coalesce ...
متن کاملBalls–in–boxes Duality for Coalescing Random Walks and Coalescing Brownian Motions
We present a duality relation between two systems of coalescing random walks and an analogous duality relation between two systems of coalescing Brownian motions. Our results extends previous work in the literature and we apply it to the study of a system of coalescing Brownian motions with Poisson immigration.
متن کاملCoalescing Random Walks and Voting on Connected Graphs
In a coalescing random walk, a set of particles make independent discrete-time random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues a random walk through the graph. Let G = (V,E), be an undirected and connected graph, with n vertices and m edges. The coalescence time, C(n), is the expected time for all particles to ...
متن کاملPoisson trees, succession lines and coalescing random walks
We give a deterministic algorithm to construct a graph with no loops (a tree or a forest) whose vertices are the points of a d-dimensional stationary Poisson process S ⊂Rd . The algorithm is independent of the origin of coordinates. We show that (1) the graph has one topological end – that is, from any point there is exactly one infinite self-avoiding path; (2) the graph has a unique connected ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2013
ISSN: 0091-1798
DOI: 10.1214/12-aop813